A speed - up theorem for cryptosystems . ( 2000 , unpublished manuscript )
نویسندگان
چکیده
We show that any encryption/decryption system can be converted to an algorithm which uses roughly three machine operations per bit. We prove that our technique yields an encryption/decryption system which is as secure as the original system provided the plaintext has full-entropy. We then show how to remove the full-entropy assumption. Our techniques speed up software implementations of RSA by four orders of magnitude. Alternatively, our techniques can be used as a blueprint for encryption/decryption circuits which are public-key yet are as fast or faster than circuits implementing private-key cryptography.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn unpublished theorem of Manfred Schocker and the Patras-Reutenauer algebra
Patras, Reutenauer (J. Algebr. Comb. 16:301–314, 2002) describe a subalgebra A of the Malvenuto-Reutenauer algebra P . Their paper contains several characteristic properties of this subalgebra. In an unpublished manuscript Manfred Schocker states without proof a theorem, providing two further characterizations of the Patras-Reutenauer algebra. In this paper we establish a slightly generalized v...
متن کاملPrime Number Generation Based On Pocklington's Theorem
Public-key cryptosystems base their security on well-known number-theoretic problems, such as factorisation of a given number n. Hence, prime number generation is an absolute requirement. Many prime number generation techniques have been proposed up-to-date, which differ mainly in terms of complexity, certainty and speed. Pocklington’s theorem, if implemented, can guarantee the generation of a ...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملTwo systolic architectures for modular multiplication
This article presents two systolic architectures to speed up the computation of modular multiplication in RSA cryptosystems. In the double-layer architecture, the main operation of Montgomery's algorithm is partitioned into two parallel operations after using the precomputation of the quotient bit. In the non-interlaced architecture, we eliminate the one-clock-cycle gap between iterations by pa...
متن کامل